---
title: "L1-062 幸运彩票"
created: 2025-11-28
tags:
  - 算法
---

# L1-062 幸运彩票

## 题目 [L1-062 幸运彩票](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1111914599412858883&page=0)

![[image-c76c0719.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};

const int inf = 0x3f3f3f3f;

int main(){

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	int n;cin>>n;

	while(n--){

		string s;cin>>s;

		int suml=0,sumr=0;

		for(int i=0;i<3;i++)	suml+=(s[i]-'0');

		for(int i=3;i<6;i++)	sumr+=(s[i]-'0');

//		cout<<suml<<" "<<sumr<<endl;

		if(suml==sumr)	cout<<"You are lucky!"<<endl;

		else	cout<<"Wish you good luck."<<endl;

	}

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-061 新胖子公式|L1-061 新胖子公式]] 🏠 [[00-天梯赛]] ➡️ [[L1-063 吃鱼还是吃肉|L1-063 吃鱼还是吃肉]]